Learning Characteristic Structured Patterns in Rooted Planar Maps
نویسندگان
چکیده
Extending the concept of ordered graphs, we propose a new data structure to express rooted planar maps, which is called a planar map pattern. In order to develop an efficient data mining method from a dataset of rooted planar maps, we propose a polynomial time algorithm for finding a minimally generalized planar map pattern, which represents maximal structural features common to rooted planar maps. Moreover, we show that the class of planar map patterns is polynomial time learnable from positive data.
منابع مشابه
Restricted rooted non-separable planar maps
Tutte founded the theory of enumeration of planar maps in a series of papers in the 1960s. Rooted non-separable planar maps have connections, for example, to pattern-avoiding permutations, and they are in one-to-one correspondence with the β(1, 0)-trees introduced by Cori, Jacquard and Schaeffer in 1997. In this paper we enumerate 2-face-free rooted non-separable planar maps and obtain restrict...
متن کاملEnumerative Properties of Rooted Circuit Maps
In 1966 Barnette introduced a set of graphs, called circuit graphs, which are obtained from 3-connected planar graphs by deleting a vertex. Circuit graphs and 3-connected planar graphs share many interesting properties which are not satisfied by general 2-connected planar graphs. Circuit graphs have nice closure properties which make them easier to deal with than 3-connected planar graphs for s...
متن کاملNew bijective links on planar maps via orientations
This article presents new bijections on planar maps. At first a bijection is established between bipolar orientations on planar maps and specific “transversal structures” on triangulations of the 4-gon with no separating 3-cycle, which are called irreducible triangulations. This bijection specializes to a bijection between rooted non-separable maps and rooted irreducible triangulations. This yi...
متن کاملOn rooted planar maps and normal planar lambda terms
A rooted planar map is a connected graph embedded in the 2-sphere, with one edge marked and assigned an orientation. A term of the pure lambda calculus is said to be linear if every variable is used exactly once, normal if it contains no β-redexes, and planar if it is linear and the use of variables moreover follows a deterministic stack discipline. We begin by showing that the sequence countin...
متن کاملEnumeration of eulerian and unicursal planar maps
Sum-free enumerative formulae are derived for several classes of rooted planar maps with no vertices of odd valency (eulerian maps) and with two vertices of odd valency (unicursal maps). As corollaries we obtain simple formulae for the numbers of unrooted eulerian and unicursal planar maps. Also, we obtain a sum-free formula for the number of rooted bi-eulerian (eulerian and bipartite) maps and...
متن کامل